Planning on a prior intention
نویسندگان
چکیده
منابع مشابه
Bounded Intention Planning Revisited
Bounded Intention Planning (BIP) [7] is a pruning approach for optimal planning with unary operators. BIP has the flavor of partial order reduction, which has recently found increasing interest for optimal planning [4, 6]. However, although BIP is claimed to be a variant of stubborn sets [3] in the original paper, no proof is given for this claim. In this paper, we shed light on the relationshi...
متن کاملIntention-Aware Motion Planning
As robots venture into new application domains as autonomous vehicles on the road or as domestic helpers at home, they must recognize human intentions and behaviors in order to operate effectively. This paper investigates a new class of motion planning problems with uncertainty in human intention. We propose a method for constructing a practical model by assuming a finite set of unknown intenti...
متن کاملBounded Intention Planning
We propose a novel approach for solving unary SAS planning problems. This approach extends an SAS instance with new state variables representing intentions about how each original state variable will be used or changed next, and splits the original actions into several stages of intention followed by eventual execution. The result is a new SAS instance with the same basic solutions as the origi...
متن کاملPlanning at the Intention Level
Intentions enable an agent to achieve long-term goals. When an agent wishes to achieve an intention, it uses actions to bring it about. In this paper we investigate the relationship between intentions and actions. We begin by describing previous work involving a responsive agent capable of coherencebased belief revision. We then describe the implementation and testing of a system capable of rep...
متن کاملBounded Intention Planning Revisited: Proof
s[v] = preo[v] s[w] = prvo[w] ∀w ∈ vars(prvo) s[Ov] = o s[Ow] = frozen ∀w ∈ vars(prvo) s[Cw] = v ∀w ∈ vars(prvo) We show that all operators o′ that interfere with Fire(o) are not applicable in s. Thus Fire(o) is the only applicable operator in Ts. Second, we show that for all these operators o′ ∈ Ts (except for Fire(o)), Ts already contains a necessary enabling set for o′ in s. Let u 6= Fire(o)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Ethics and Social Philosophy
سال: 2020
ISSN: 1559-3061
DOI: 10.26556/jesp.v18i3.850